Towards Advanced Systems for Abstract Argumentation

نویسنده

  • Stefan Woltran
چکیده

Within the last years, and in particular due to the first edition of the International Competition on Computational Models of Argumentation (ICCMA) in 2015, the field of formal argumentation has seen an increasing number of systems for Dung’s abstract argumentation framework. However, the majority of the current approaches rely on reductions to other solving paradigms like SAT-solving and Answer-Set Programming, thus leaving genuine features of abstract argumentation rather unexploited. In this talk, we present a few directions for the development of next-generation argumentation systems that take recent theoretical advances into account and discuss challenges as well as potential pitfalls in this endeavor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Methods for solving reasoning problems in abstract argumentation – A survey

Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence. Besides providing a core formalism for many advanced argumentation systems, abstract argumentation has also served to capture several non-monotonic logics and other AI related principles. Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this f...

متن کامل

Probabilistic abstract argumentation: an investigation with Boltzmann machines

Probabilistic argumentation and neuro-argumentative systems offer new computational perspectives for the theory and applications of argumentation, but their principled construction involve two entangled problems. On the one hand, probabilistic argumentation aims at combining the quantitative uncertainty addressed by probability theory with the qualitative uncertainty of argumentation, but proba...

متن کامل

Improved answer-set programming encodings for abstract argumentation

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by...

متن کامل

Social Abstract Argumentation

In this paper we take a step towards using Argumentation in Social Networks and introduce Social Abstract Argumentation Frameworks, an extension of Dung’s Abstract Argumentation Frameworks that incorporates social voting. We propose a class of semantics for these new Social Abstract Argumentation Frameworks and prove some important non-trivial properties which are crucial for their applicabilit...

متن کامل

Towards a New Framework for Recursive Interactions in Abstract Bipolar Argumentation

This paper proposes a new framework able to take into account recursive interactions in bipolar abstract argumentation systems. We address issues such as “How an interaction can impact another one?”, or in other words “How can the validity of an interaction be affected if this interaction is attacked or supported by another one?”. Thus, using numerous examples, a new method for flattening such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016